Early search termination for fast motion estimation
نویسنده
چکیده
This paper proposes a novel method for early termination of a motion search. It first introduces an estimator of the sum of absolute difference (SAD) between the current block and a search point. After analyzing the SAD estimator, it proposes the SAD condition to decide whether the current search point is around a minimum point or not. The counter condition is used to evaluate the current search point as an early search termination cue. After the current search point is considered as a minimum point, the search is stopped immediately. The proposed algorithm can easily be combined with most existing fast motion estimation algorithms to further reduce computational cost. While previous thresholding techniques have focused on the correlation of SAD values between a current block and its neighboring blocks, the proposed algorithm studies its own characteristics to predict the threshold. Hence, the proposed termination scheme can complement the previous early search termination techniques by merging the termination methods together, in order to further reduce computational cost. Experimental results demonstrate that the proposed algorithm successfully reduces the computational cost by combining the previous early search termination techniques.
منابع مشابه
Adaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملContent-Aware Fast Motion Estimation Algorithm
In this paper, we propose the Content-Aware Fast Motion Estimation Algorithm (CAFME) that can reduce computation complexity of motion estimation (ME) in H.264/AVC while maintaining almost the same coding efficiency. Motion estimation can be divided into two phases: searching phase and matching phase. In searching phase, we propose the Simple Dynamic Search Range Algorithm (SDSR) based on video ...
متن کاملFast motion search with efficient inter-prediction mode decision for H.264
A fast inter-prediction mode decision and motion search algorithm is proposed for the H.264 video coding standard. The multi-resolution motion estimation scheme and an adaptive rate-distortion model are employed with early termination rules to accelerate the search process. With the new algorithm, the amount of computation involved in the motion search can be substantially reduced. Experimental...
متن کاملNovel adaptive block-matching algorithm using modified switching search patterns
Motion estimation is regarded as vital importance for video coding. When designing search methods for motion estimation, both the estimation accuracy and computational complexity are the main considerations. The existing fast search methods such as TSS, NTSS, DS and ARPS can provide satisfactory result at a very low computational cost but within their own best application range. Besides, none o...
متن کاملComprehensive scheme for subpixel variable block-size motion estimation
Fast variable block-size motion estimation is a key issue for real-time applications of the H.264, whereas the subpixel refinement takes up much computational time as compared to integer-pixel motion estimation. We propose a new fast subpixel precision variable block-size motion-estimation scheme. This algorithm uses the statistical information, which comes from the motion activities of the mac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- EURASIP J. Image and Video Processing
دوره 2015 شماره
صفحات -
تاریخ انتشار 2015